Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
a(b(a(x))) |
→ b(a(b(x))) |
|
There is one dependency pair:
The approximated dependency graph contains one SCC:
{2}.
-
Consider the SCC {2}.
There are no usable rules.
By taking the AF π with
π(A) = π(b) = 1 together with
the lexicographic path order with
empty precedence,
rule 2
is strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006